FPT University - PDFSEARCH.IO - Document Search Engine

FPT University
Results: 22

#	Item
11	On Linear and Quasi-Linear CPU Times for Most Relational Calculus and Data Mining Queries Dan E. Willard University at Albany – SUNY Alternate Title of Talk: “ A 15-minute Summary of 35 Years of Prior Research PLUS A Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2013-02-02 11:06:30 Computer science Relational algebra FO Database theory Lambda calculus Expected value Calculus Conjunctive query Theoretical computer science Relational model Applied mathematics
12	Blow-Ups, Win/Win’s, and Crown Rules: Some New Directions in FPT Michael R. Fellows School of Electrical Engineering and Computer Science University of Newcastle, University Drive, Callaghan NSW 2308, Australia mfellow Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-05 20:16:31 NP-complete problems Parameterized complexity Kernelization Dominating set Vertex cover Path decomposition Planar separator theorem Clique problem Graph coloring Theoretical computer science Graph theory Mathematics
13	Sponsored by Charles Darwin University (CDU), Northern Territory, AUSTRALIA PARAMETERIZED COMPLEXITY: NOT-ABOUT-GRAPHS! See website: www.cdu.edu.au/parameterized-nag and below. DESCRIPTION To date, much of the work in p Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2012-09-17 04:51:39 Ethology Parameterized complexity Darwin–Wedgwood family Fellows of the Royal Society Charles Darwin University Computational complexity theory Charles Darwin Largest-scale trends in evolution Northern Territory Science Michael Fellows Academia
14	WO RKSHO P O N PARAM ETERI ZED CO M PLEXI TY http:/ / fpt.wikidot.com 30&31 March 2010 The University of Newcastle, AU ABSTRACTS OF TALKS Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2012-09-17 04:49:01 Complexity classes NP-complete problems Analysis of algorithms Parameterized complexity NP-complete Vertex cover Time complexity Travelling salesman problem Matching Theoretical computer science Computational complexity theory Applied mathematics
15	Computing Distances Between Evolutionary Trees Catherine McCartin Massey University, New Zealand and Magnus Bordewich, Michael Hallett, Charles Semple Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2012-09-17 05:11:30 Tree Science Mathematics Biology Unrooted binary tree Tree rearrangement Phylogenetics Computational phylogenetics Phylogenetic tree
16	Algebraization in parameterized algorithms and complexity and complexity Yiannis Koutis University of Puerto Rico,Rio Piedras Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2013-02-01 22:18:40 Algorithm Mathematical logic Color-coding SL Graph coloring Analysis of algorithms Theoretical computer science Mathematics Applied mathematics
17	Sponsored by Charles Darwin University (CDU), Northern Territory, AUSTRALIA PARAMETERIZED COMPLEXITY: NOT-ABOUT-GRAPHS! See website: www.cdu.edu.au/parameterized-nag and below. DESCRIPTION To date, much of the work in p Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2012-09-17 04:51:46 Ethology Parameterized complexity Darwin–Wedgwood family Fellows of the Royal Society Charles Darwin University Computational complexity theory Charles Darwin Largest-scale trends in evolution Northern Territory Science Michael Fellows Academia
18	Leo Brueggeman, University of California, Santa Cruz Jon Borwein, University of Newcastle, Australia Add to Reading List Source URL: fpt.wdfiles.com - Date: 2012-09-17 05:47:59
19	Welcome Frances Rosamond, Editor, Charles Darwin University Congratulations to award winners, graduates and new job holders. IPEC, ALGO and GROW had excellent parameterized talks and tutorials. We feature Combinatorial S Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2013-11-18 03:54:41 Computational complexity theory Parameterized complexity FO
20	Welcome Frances Rosamond, Editor, Charles Darwin University Welcome to the Parameterized Complexity Newsletter. Congratulations to award winners and graduates. Note that the community wiki www.fpt.wikidot.com now has a T Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2013-04-30 02:47:45 Complexity classes NP-complete problems Analysis of algorithms Parameterized complexity Kernelization Vertex cover Algorithm Combinatorial optimization FO Theoretical computer science Computational complexity theory Applied mathematics

UPDATE